Analysis and Design of Partially Information- and Partially Parity-Coupled Turbo Codes

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and parity-coupled codes. This codes enjoy several advantages such as flexible code rate adjustment by varying the coupling ratio encoding decoding architectures underlying component can remain unchanged. For work, first provide construction methods for with memory m corresponding graph models. We then derive density evolution equations ensembles on binary erasure channel to precisely compute their iterative thresholds. Rate-compatible designs thresholds are also provided, where puncturing ratios jointly optimized achieve largest threshold given target rate. Our results show that wide range rates, proposed attain close-to-capacity performance improves increasing memory. particular, have within 0.0002 BEC capacity rates ranging from 1/3 9/10, yielding an attractive way constructing rate-compatible capacity-approaching